Suux Binary Search Trees and Suux Arrays
نویسندگان
چکیده
Suux arrays and suux binary search trees are two data structures that have been proposed as alternatives to the classical suux tree to facilitate eecient on-line string searching. Here, we explore the relationship between these two structures. In particular, we present an alternative view of a suux array, with its auxiliary information, as a perfectly balanced suux binary search tree, and describe an elegant and eecient algorithm to construct the suux array and its auxiliaries from an arbitrary suux binary search tree.
منابع مشابه
Compressed Suux Arrays and Suux Trees with Applications to Text Indexing and String Matching
The proliferation of online text, such as on the World Wide Web and in databases, motivates the need for space-eecient index methods that support fast search. Consider a text T of n binary symbols to index. Given any query pattern P of m binary symbols, the goal is to search for P in T quickly, with T being fully scanned only once, namely, when the index is created. All indexing schemes publish...
متن کاملTrade Oo between Compression and Search times in Compact Suux Array ?
Suux array is a widely used full-text index that allows fast searches on the text. It is constructed by sorting all suuxes of the text in the lexicographic order and storing pointers to the suuxes in this order. Binary search is used for fast searches on the suux array. Compact suux array is a compressed form of the suux array that still allows binary searches, but the search times are also dep...
متن کاملSpace Eecient Suux Trees
We give the rst representation of a suux tree that uses n lg n + O(n) bits of space and supports searching for a pattern string in the given text (from a xed size alphabet) in O(m) time, where n is the size of the text and m is the length of the pattern. The structure is quite simple and answers a question raised by Muthukrishnan in 22]. Previous compact representations of suux trees had either...
متن کاملCompact Suux Array ?
Suux array is a data structure that can be used to index a large text le so that queries of its content can be answered quickly. Basically a suux array is an array of all suuxes of the text in the lexico-graphic order. Whether or not a word occurs in the text can be answered in logarithmic time by binary search over the suux array. In this work we present a method to compress a suux array such ...
متن کاملPersistent Su x Trees and Su x BinarySearch Trees as DNA Sequence
We constructed, stored on disk and reused suux trees and suux binary search trees for C. elegans chromosomes, and measured their performance using orthogonal persistence for Java (PJama). We compare our implementation with the performance of a transient 1 suux tree, and discuss the suitability of such indexes in pursuing our long-term goal of indexing large genomes. We identify the potential fo...
متن کامل